923 research outputs found

    Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks

    Full text link
    It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventional methods, agent nodes are divided into different layers with the aid of the space-time hierarchical-model and their positions are estimated gradually. In particular, an information propagation rule is conceived upon considering the quality of positional information. According to the rule, the information always propagates from the upper layers to a certain lower layer and the message passing process is further optimized at each layer. Hence, the potential error propagation can be mitigated. Additionally, both position estimation and position broadcasting are carried out by the sensor nodes. Furthermore, a sensor activation mechanism is conceived, which is capable of significantly reducing both the energy consumption and the network traffic overhead incurred by the localization process. The analytical and numerical results provided demonstrate the superiority of our space-time hierarchical-graph based cooperative localization scheme over the benchmarking schemes considered.Comment: 14 pages, 15 figures, 4 tables, accepted to appear on IEEE Transactions on Signal Processing, Sept. 201

    Combining Support Vector Machine and Data Envelopment Analysis to Predict Corporate Failure for Nonmanufacturing Firms

    Get PDF
    Workshop 2015 -Advances in DEA Theory and Applications (December 1-2, 2015)Research on corporate failure prediction has drawn numerous scholars’ attention because of its usefulness in corporate risk management, as well as in regulating corporate operational status. Most previous research related to this topic focused on manufacturing companies and relied heavily on corporate assets. The asset size of a manufacturing company plays a vital role in traditional research methods; Altman’s Z score model is one such traditional method. However, very limited number of research studied corporate failure prediction for nonmanufacturing companies as the operational status of such companies is not solely correlated to their assets. In this manuscript we use support vector machines (SVMs) and data envelopment analysis (DEA) to provide a new method for predicting corporate failure of nonmanufacturing firms. We first generate efficiency scores using a slack-based measure (SBM) DEA model, using the recent three years historical data of nonmanufacturing firms; then we used SVMs to classify bankrupt firms and healthy ones. We show that using DEA scores as the only inputs into SVMs predict corporate failure more accurately than using the entire raw data available.The workshop is supported by JSPS (Japan Society for the Promotion of Science), Grant-in-Aid for Scientific Research (B), #25282090, titled “Studies in Theory and Applications of DEA for Forecasting Purpose.本研究はJSPS科研費 基盤研究(B) 25282090の助成を受けたものです

    A shooting algorithm for complex immunodominance control problems

    Get PDF
    Although T cells are able to recognize a wide variety of target peptides, they are often strongly focused on a few of the peptides and leave the rest of them unattended. This phenomenon of strongly biased immune response is known as immunodominance. Mathematically, an immunodominance problem can be formulated using optimal control principles as a two-point boundary-value problem. The solution of this problem is challenging especially when the control variables are bounded. In this work, we develop a numerical algorithm based on the shooting technique for bounded optimal control problems. The algorithm is applied to a group of immunodominance problems. Numerical simulations reveal that the immune system selects either a broad or a specific strategy of immunodominance based on different optimization goals. The shooting algorithm can also be utilized to solve other complex optimal control problems. doi: 10.1109/IEMBS.2009.533356
    corecore